|
|
Hardware Acceleration of Cipher Attack
Okuliar, Adam ; Slaný, Karel (referee) ; Vašíček, Zdeněk (advisor)
Hardware acceleration is often good tool to achieve significantly better performance of processing great ammount of data or of realization of parallel algoritms. Aim of this work is to demonstrate resoluts of using FPGA circuits for implementation exponentially complex algorithm. As example haschosen brute-force attack on WEP cryptographic algorithm with 40-bit long key. Goal of this work is to compare properties and performance of software and hardware implementation of choosen algorithm.
|
|
|
Face Identification
Částek, Petr ; Jaša, Petr (referee) ; Chmelař, Petr (advisor)
This document is trying to introduce the reader with issues of identifying the face connected with miscellaneous scanning technologies and enviroments. Inside this document there are mentioned some possibilities of creation unique print of a face so that there would be denied unwanted effects of enviroment and the identification of persons would be possible.
|
|
|
Implementation of Bloom Filters in FPGA
Matoušek, Denis ; Kaštil, Jan (referee) ; Žádník, Martin (advisor)
The thesis deals with probabilistic data structure Bloom filter and its modifications - counting Bloom filter and multistage filter. The fundamentals of these data structures are explained and the mathematical equations describing their properties including the equation to minimize the false positive rate are shown. Appropriate hash function is chosen considering an implementation on a FPGA chip. Designs of architectures of the hash function and data structures are implemented in VHDL language and their synthesis is done. Its results are discussed considering occupied resources of a FPGA chip, a critical path and maximum frequency.
|
|
|
Secure Implementation of Blockchain Technology
Kovář, Adam ; Fujdiak, Radek (referee) ; Malina, Lukáš (advisor)
This thesis describes basis of blockchain technology implementation for SAP Cloud platform with emphasis to security and safety of critical data which are stored in blockchain. This diploma thesis implements letter of credit to see and control business process administration. It also compares all the possible technology modification. Thesis describes all elementary parts of software which are necessary to implement while storing data and secure integrity. This thesis also leverages ideal configuration of each programable block in implementation. Alternative configurations of possible solutions are described with pros and cons as well. Another part of diploma thesis is actual working implementation as a proof of concept to cover letter of credit. All parts of code are design to be stand alone to provide working concept for possible implementation and can source as a help to write productive code. User using this concept will be able to see whole process and create new statutes for whole letter of credit business process.
|
|
|
Photos with Timestamp
Mlejnek, Matěj ; Herout, Adam (referee) ; Zemčík, Pavel (advisor)
This thesis describes the design and implementation of a system for creating timestamps for photos in groups. It deals with the ways the group timestamp of multiple photos can be verified all at once. The whole system can be split into four parts. The first part is a mobile application, in which photos are taken by the user. The second part is the server on which photos are backed up and which relays the photos to a server that makes group timestamps. The third part is the server itself that creates the timestamps. The fourth part consists of user tools for retrospectively checking the existence of a valid group timestamp.
|
|
|
Influence of Network Infrastructure on Distributed Password Cracking
Eisner, Michal ; Zobal, Lukáš (referee) ; Hranický, Radek (advisor)
Password cracking is a process used to obtain the cracking key through which we get access to encrypted data. This process normally works on the principle of the repeated try of attempts and their verification by making calculations of cryptographic algorithms. The difficulty of algorithms affects the time spent on solving of the calculations. In spite of various acceleration methods, it is often necessary to distribute the given problem among several nodes which are interconnected via the local network or the internet. The aim of this thesis is to analyze the influence of network infrastructure on the speed, the scalability, and the utilization during different attacks on cryptographical hashes. For these purposes, there was created an automatized experimental environment, which consists of distinctive topologies, scripts, and sets of testing tasks. Based on the results of the analysis, which were obtained by the usage of tools Fitcrack and Hashtopolis it was possible to observe this influence.
|
|
|
Searching algorithms
Ďuriš, Martin ; Šeda, Miloš (referee) ; Dvořák, Jiří (advisor)
The thesis describes and analyzes selected searching algorithms for single dimensional array. Algorithms are analyzed mathematically and graphically. Mathematical analysis is based on analysis of average amount of performed comparisons required for the final result and literature review. Graphical analysis is based on multiple examinations of selected searching methods with randomly generated single dimensional arrays. The graphs show dependency of elapsed searching time of successful and unsuccessful searching trial on the size of single dimensional array. The results establish the binary searching algorithm as the fastest one of the selected searching algorithms.
|
|
|
Image hashing using compressed sensing
Kopec, Peter ; Číka, Petr (referee) ; Rajmic, Pavel (advisor)
This thesis is devoted to the analysis and implementation of image hashing based on the article "Robust image hashing with compressed sensing and ordinal measures"[3]. Image hashing uses so-called perceptual hashing methods. These methods have great applications in computer vision science, and the properties of these methods allow us to compare the similarity of hashed images and classify these images into groups. We can use this comparison, for example, to search images on the Internet for various reasons. In the theoretical part, we will talk more about the properties of these hashing methods and describe the hashing method according to the mentioned paper, we will focus most on what is compressive sampling, saliency map and how we achieve it. In the practical part, we will prepare a test dataset using Python scripting language and implement the hashing method according to the mentioned article. Then we test this hashing method on this dataset and finally compare it with another hashing method.
|
|
|
Secure Implementation of Blockchain Technology
Kovář, Adam ; Fujdiak, Radek (referee) ; Malina, Lukáš (advisor)
This thesis describes basis of blockchain technology implementation for SAP Cloud platform with emphasis to security and safety of critical data which are stored in blockchain. This diploma thesis implements letter of credit to see and control business process administration. It also compares all the possible technology modification. Thesis describes all elementary parts of software which are necessary to implement while storing data and secure integrity. This thesis also leverages ideal configuration of each programable block in implementation. Alternative configurations of possible solutions are described with pros and cons as well. Another part of diploma thesis is actual working implementation as a proof of concept to cover letter of credit. All parts of code are design to be stand alone to provide working concept for possible implementation and can source as a help to write productive code. User using this concept will be able to see whole process and create new statutes for whole letter of credit business process.
|
|
|
Influence of Network Infrastructure on Distributed Password Cracking
Eisner, Michal ; Zobal, Lukáš (referee) ; Hranický, Radek (advisor)
Password cracking is a process used to obtain the cracking key through which we get access to encrypted data. This process normally works on the principle of the repeated try of attempts and their verification by making calculations of cryptographic algorithms. The difficulty of algorithms affects the time spent on solving of the calculations. In spite of various acceleration methods, it is often necessary to distribute the given problem among several nodes which are interconnected via the local network or the internet. The aim of this thesis is to analyze the influence of network infrastructure on the speed, the scalability, and the utilization during different attacks on cryptographical hashes. For these purposes, there was created an automatized experimental environment, which consists of distinctive topologies, scripts, and sets of testing tasks. Based on the results of the analysis, which were obtained by the usage of tools Fitcrack and Hashtopolis it was possible to observe this influence.
|
guest ::
